Rigid Point Registration with Expectation Conditional Maximization

نویسنده

  • Jing Wu
چکیده

This paper addresses the issue of matching rigid 3D object points with 2D image points through point registration based on maximum likelihood principle in computer simulated images. Perspective projection is necessary when transforming 3D coordinate into 2D. The problem then recasts into a missing data framework where unknown correspondences are handled via mixture models. Adopting the Expectation Conditional Maximization for Point Registration (ECMPR), two different rotation and translation optimization algorithms are compared in this paper. We analyze in detail the associated consequences in terms of estimation of the registration parameters theoretically and experimentally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Point Based Non-rigid Registration Method and Its Application on Brain Shift∗

This paper presents a novel point based non-rigid registration (NRR) method. We overcome the limitations of the traditional point-based NRR methods by using a biomechanical model with a Robust Point Matching framework. Our new framework relies on robust regression technique to handle sparse point sets which are partially correlated. The non-rigid registration problem is formulated as a two vari...

متن کامل

Rigid Point-Surface Registration Using an EM Variant of ICP for Computer Guided Oral Implantology

We investigate the rigid registration of a set of points onto a surface for computer-guided oral implants surgery. We first formulate the Iterative Closest Point (ICP) algorithm as a Maximum Likelihood (ML) estimation of the transformation and the matches. Then, considering matches as a hidden random variable, we show that the ML estimation of the transformation alone leads to a criterion effic...

متن کامل

Smooth point-set registration using neighboring constraints

We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...

متن کامل

An Expectation Maximization-Like Algorithm for Multi-Atlas Multi-Label Segmentation

We present in this paper a novel interpretation of the concept of an “expert” in image segmentation as the pairing of an atlas image and a non-rigid registration algorithm. We introduce an extension to a recently presented expectation maximization (EM) algorithm for ground truth recovery, which allows us to integrate the segmentations obtained from multiple experts (i.e., from multiple atlases ...

متن کامل

Non-rigid point set registration: Coherent Point Drift

We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation problem with motion coherence constraint over the velocity field such that one point set moves coherently to align with the second set. We formulate the motion coherence constraint and derive a solution of regularized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018